github.com/klauspost/compress/zstd.doubleFastEncoder.longTable (field)

21 uses

	github.com/klauspost/compress/zstd (current package)
		enc_dfast.go#L27: 	longTable [dFastLongTableSize]tableEntry
		enc_dfast.go#L50: 			e.longTable = [dFastLongTableSize]tableEntry{}
		enc_dfast.go#L65: 		for i := range e.longTable[:] {
		enc_dfast.go#L66: 			v := e.longTable[i].offset
		enc_dfast.go#L72: 			e.longTable[i].offset = v
		enc_dfast.go#L128: 			candidateL := e.longTable[nextHashL]
		enc_dfast.go#L134: 			e.longTable[nextHashL] = entry
		enc_dfast.go#L208: 				candidateL = e.longTable[nextHashL]
		enc_dfast.go#L212: 				e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
		enc_dfast.go#L300: 		e.longTable[hashLen(cv0, dFastLongTableBits, dFastLongLen)] = te0
		enc_dfast.go#L301: 		e.longTable[hashLen(cv1, dFastLongTableBits, dFastLongLen)] = te1
		enc_dfast.go#L334: 			e.longTable[nextHashL] = entry
		enc_dfast.go#L385: 		for i := range e.longTable[:] {
		enc_dfast.go#L386: 			e.longTable[i] = tableEntry{}
		enc_dfast.go#L434: 			candidateL := e.longTable[nextHashL]
		enc_dfast.go#L440: 			e.longTable[nextHashL] = entry
		enc_dfast.go#L515: 				candidateL = e.longTable[nextHashL]
		enc_dfast.go#L519: 				e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
		enc_dfast.go#L604: 		e.longTable[hashLen(cv0, dFastLongTableBits, dFastLongLen)] = te0
		enc_dfast.go#L605: 		e.longTable[hashLen(cv1, dFastLongTableBits, dFastLongLen)] = te1
		enc_dfast.go#L639: 			e.longTable[nextHashL] = entry